Matrix P-norms are NP-hard to approximate if p \neq 1,2,\infty
نویسندگان
چکیده
We show that for any rational p ∈ [1, ∞) except p = 1, 2, unless P = N P , there is no polynomial-time algorithm which approximates the matrix p-norm to arbitrary relative precision. We also show that for any rational p ∈ [1, ∞) including p = 1, 2, unless P = N P , there is no polynomial-time algorithm which approximates the ∞, p mixed norm to some fixed relative precision.
منابع مشابه
Which elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملInapproximability Results for the Closest Vector Problem with Preprocessing over infty Norm
We show that the Closest Vector Problem with Preprocessing over `∞ norm (CVPP∞) is NP-hard to approximate to within a factor of (log n)1/2− , unless NP⊆ DTIME (2polylog(n)). The result is the same as that in [19] by Regev and Rosen, but our proof methods are different from theirs. Their reductions are based on norm embeddings. However, our reductions are based on the reduction of [2] and the pr...
متن کاملA note on scheduling with low rank processing times
We consider the classical minimum makespan scheduling problem, where the processing time of job j on machine i is pij , and the matrix P = (pij)m×n is of a low rank. It is proved in [1] that rank 7 scheduling is NP-hard to approximate to a factor of 3/2− ǫ, and rank 4 scheduling is APX-hard (NP-hard to approximate within a factor of 1.03− ǫ). We improve this result by showing that rank 4 schedu...
متن کاملApproximately certifying the restricted isometry property is hard
Amatrix is said to possess the Restricted Isometry Property (RIP) if it acts as an approximate isometry when restricted to sparse vectors. Previous work has shown it to be np-hard to determine whether a matrix possess this property, but only in a narrow range of parameters. In this work, we show that it is np-hard to make this determination for any accuracy parameter, even when we restrict ours...
متن کاملHardness of Approximation for Sparse Optimization with L0 Norm
In this paper, we consider sparse optimization problems with L0 norm penalty or constraint. We prove that it is strongly NP-hard to find an approximate optimal solution within certain error bound, unless P = NP. This provides a lower bound for the approximation error of any deterministic polynomialtime algorithm. Applying the complexity result to sparse linear regression reveals a gap between c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0908.1397 شماره
صفحات -
تاریخ انتشار 2009